منابع مشابه
Weak Representations of Interval Algebras
Ladkin and Maddux [LaMa87] showed how to interpret the calculus of time intervals defined by Allen [AZ2831 in terms of representations of a particular relation algebra, and proved that this algebra has a unique countable representation up to isomorphism. In this paper, we . consider the algebra An of n-intervals, which coincides with Allen’s algebra for n=2, and prove that An has a unique count...
متن کاملParallel Interval Order Recognition and Construction of Interval Representations
Parallel algorithms for recognizing and representing interval orders are proposed for differ. ent models of parallel random access machines (PRAM). The algorithms accept as input a transitively~losed directed graph with N nodes and M edges. They run in time O0og N) with O(N + M~ processors and O{N + M} space and in co , tam time with O(N z) proces~rs and O{N ~) space depending on the data struc...
متن کاملBounded Representations of Interval and Proper Interval Graphs
Klav́ık et al. [arXiv:1207.6960] recently introduced a generalization of recognition called the bounded representation problem which we study for the classes of interval and proper interval graphs. The input gives a graph G and in addition for each vertex v two intervals Lv and Rv called bounds. We ask whether there exists a bounded representation in which each interval Iv has its left endpoint ...
متن کاملGames on interval and permutation graph representations
We describe combinatorial games on graphs in which two players antagonistically build a representation of a subgraph of a given graph. We show that for a large class of these games, determining whether a given instance is a winning position for the next player is PSPACE-hard. In contrast, we give polynomial time algorithms for solving some versions of the games on trees.
متن کاملInterval Graphs: Canonical Representations in Logspace
We present a logspace algorithm for computing a canonical labeling, in fact a canonical interval representation, for interval graphs. To achieve this, we compute canonical interval representations of interval hypergraphs. This approach also yields a canonical labeling of convex graphs. As a consequence, the isomorphism and automorphism problems for these graph classes are solvable in logspace. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TEMA - Tendências em Matemática Aplicada e Computacional
سال: 2004
ISSN: 2179-8451,1677-1966
DOI: 10.5540/tema.2004.05.02.0317